process scheduling

A production process monitoring and management system including real time data collecting of production facilities, technological data analyzing based network and real time database and CBR ( case based reasoning) based scheduling strategy are introduced.

介绍了具有生产过程实时数据采集，基于网络和实时数据库的工艺数据分析与管理等的生产过程监控与管理系统。

Production scheduling of batch process with parallel machines is studied in the production scheduling pattern. Sequence independent changeover time and sequence dependent changeover time are distinguished in the scheduling problem.

针对批量过程型多机器并行加工生产环境，研究了具有顺序无关型产品切换时间和顺序相关型产品切换时间两种调度问题。

Information transfer and database sharing among scheduling terminal and process terminals.

主调度终端与各工序终端之间进行消息传递和数据库共享。

Research on Process Scheduling in Embedded Operating System

嵌入式操作系统进程调度研究

The scheduling problem of the running process of transporting system in an automated warehouse is studied using the object oriented colored Petri nets model and the temporal logic method.

基于面向对象着色Petri网模型和时态逻辑方法，对自动化仓库输送系统运行过程的调度问题进行研究。

This method further considers the interaction of scheduling with allocation in the process of scheduling, and presents a new form of energy function involving three factors: time, cost and Utility Ratio. The result of allocation is treated as a factor of energy function.

为了在调度过程中进一步考虑调度和分配的相互作用，提出了同时考虑时间、造价和功能单元利用率的能量函数，将分配结果作为计算调度方案能量函数的要素之一。

This scheduling model can be used to simulated production process, and can be used to analyze and synthesize real time scheduling policy.

基于这一模型，既可以仿真整个生产过程，又可以分析和综合实时调度策略。

Nonblocking algorithms are used extensively at the operating system and JVM level for tasks such as thread and process scheduling.

无阻塞算法被广泛用于操作系统和JVM级别，进行诸如线程和进程调度等任务。

Scheduling Strategy of Process Sequence for Rewind Cell of Fiber Manufacturing

光纤制造中复绕单元加工次序调度策略的研究

In the search process, the upper bound and lower bound of the train travel time, as well as the alternative-graph-based branch-and-bound rules, are used to cut the branches dissatisfying the conditions to reduce the search time and ensure the real-time character of train scheduling.

在搜索过程中，利用列车运行时间上界和下界值以及基于替换图的分支定界规则对不满足条件的分支进行剪枝，减少搜索时间，保证列车调度的实时性。

The paper first presents an objective model of task scheduling, and then based on the analysis of Q learning algorithm, the Markov decision process description of the scheduling problem is given.

首先建立任务调度问题的目标模型，在分析Q学习算法的基础上，给出调度问题的马尔可夫决策过程描述；

Linux divides the process into real-time process and non-real time process. It makes use of scheduling policy in the combination of time-sharing quantum troll and deprivable scheduling priority.

Linux把进程分为实时进程和非实时进程来处理，它采用时间片轮转和可剥夺调度优先级相结合的调度策略。